Effects of Change of Scale on Optimality in a Scheduling Model with Priorities and Earliness/Tardiness Penalties

نویسنده

  • N. V. R. MAHADEV
چکیده

we consider the effect of changes of scale of measurement on the conclusion that a particular solution to a scheduling problem is optimal. The analysis in this paper was motivated by the problem of finding the optimal transportation schedule when there are penalties for both late and early arrivals, and when different items that need to be transported receive different priorities. We note that in this problem, if attention is paid to how certain parameters are measured, then a change of scale of measurement might lead to the anomalous situation where a schedule is optimal if the parameter is measured in one way, but not if the parameter is measured in a different way that seems equally acceptable. This conclusion about the sensitivity of the conclusion that a given solution to a combinatorial optimisation problem is optimal is different from the usual type of conclusion in sensitivity analysis, since it holds even though there is no change in the objective function, the constraints, or other input parameters, but only in scales of measurement. We emphasize the need to consider such changes of scale in analysis of scheduling and other combinatorial optimization problems. We also discuss the mathematical problems that arise in two special csses, where all desired arrival times are the same and the simplest case where they are not, namely the case where there are two distinct arrival times but one of them occurs exactly once. While specialized, these two examples illustrate the types of mathematical problems that arise from considerations of the interplay between scaletypes and optimisation. Keywords-Scheduling, Meaningfulness, Measurement, Earliness/tardiness penalties, Modeling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production

Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...

متن کامل

A Scheduling Model of Flexible Manufacturing System to Reduce Waste and Earliness/Tardiness Penalties

Nowadays, flexible manufacturing system (FMS) is introduced as a response to the competitive environment. Scheduling of FMS is more complex and more difficult than the other scheduling production systems. One of the main factors in scheduling of FMS is variable time of taking orders from customers, which leads to a sudden change in the manufacturing process. Also, some problems are created in p...

متن کامل

Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties

  Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...

متن کامل

A Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

متن کامل

The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach

Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997